The Upper Bounds for Performance Measures of a Finite Capacity Polling System under ATM Bursty Arrivals
نویسنده
چکیده
This paper focuses on the upper bounds for both the mean delay and the loss probability that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is assumed to be bursty and is modeled by an Interrupted Bernoulli Process(IBP). We compute the upper bounds for this polling system by considering a cell multiplexer with the same arrival processes and equal queue capacity. Under the ATM environment, the mean delay obtained from this multiplexer cannot only serve as an upper bound but also render a fairly accurate estimation for the mean delay of the polling system. For the cell loss probability, we consider a multiple urn model with uniform occupancy distribution which will guarantee the upper bound. Also, a heuristic method is proposed to give better estimation for cases which have medium to high cell loss rate. These analytic results are compared against the simulation results of the polling system to validate this approach. The Upper Bounds for Performance Measures .. · Jou, Nilsson, and Lai.
منابع مشابه
Tractable Analysis of a Finite Capacity Polling System under Bursty and Correlated Arrivals
This paper is concerned with the mean delay and the probability of cell loss that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is modeled by a Markov Modulated Bernoulli Process(MMBP) which is able to describe the bursty and correlated nature of th...
متن کاملA Refined Approximation of a Finite Capacity Polling System under ATM Bursty Arrivals
This paper is concerned with both the mean delay and the probability of cell loss that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is assumed to be bursty and is modeled by an Interrupted Bernoulli Process(IBP). A practical polling system with fin...
متن کاملAdaptive Polling Schemes for an ATM Bus with Bursty Arrivals
We consider a high speed ATM bus, which can serve a small number of stations (~ 16). The bus is slotted and each slot is long enough to contain one ATM cell. Transmission on the bus is controlled by an arbitrator. Each station sends its status information to the arbitrator at regular intervals. Based on this information the arbitrator makes polling decisions. Due to transmission and processing ...
متن کاملAlgorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity
We address the batch arrival systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...
متن کامل